翻訳と辞書 Words near each other ・ Acleris baleina ・ Acleris bengalica ・ Acleris bergmanniana ・ Acleris bicolor ・ Ackerman Ridge ・ Ackerman syndrome ・ Ackerman, California ・ Ackerman, Mississippi ・ Ackerman, West Virginia ・ Ackerman-Boyd House ・ Ackerman-Dater House ・ Ackerman-Dewsnap House ・ Ackerman-Smith House ・ Ackermann ・ Ackermann (surname) ・ Ackermann function ・ Ackermann ordinal ・ Ackermann set theory ・ Ackermann steering geometry ・ Ackermann's Repository ・ Ackermann–Teubner Memorial Award ・ Ackermans ・ Ackermans & van Haaren ・ Ackermans (disambiguation) ・ Ackermans Mills, New Jersey ・ Ackermanville, Pennsylvania ・ Ackers ・ Ackersdijk en Vrouwenregt ・ Ackerson ・ Ackerson Creek Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Ackermann function ： ウィキペディア英語版 Ackermann function In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive. After Ackermann's publication of his function (which had three nonnegative integer arguments), many authors modified it to suit various purposes, so that today "the Ackermann function" may refer to any of numerous variants of the original function. One common version, the two-argument Ackermann–Péter function, is defined as follows for nonnegative integers ''m'' and ''n'': :$A(m,\; n)\; =$ \begin n+1 & \mbox m = 0 \\ A(m-1, 1) & \mbox m > 0 \mbox n = 0 \\ A(m-1, A(m, n-1)) & \mbox m > 0 \mbox n > 0. \end Its value grows rapidly, even for small inputs. For example ''A''(4,2) is an integer of 19,729 decimal digits.〔(Decimal expansion of A(4,2) ) 〕 ==History== In the late 1920s, the mathematicians Gabriel Sudan and Wilhelm Ackermann, students of David Hilbert, were studying the foundations of computation. Both Sudan and Ackermann are credited with discovering total computable functions (termed simply "recursive" in some references) that are not primitive recursive. Sudan published the lesser-known Sudan function, then shortly afterwards and independently, in 1928, Ackermann published his function $\backslash varphi\backslash ,\backslash !$. Ackermann's three-argument function, $\backslash varphi(m,\; n,\; p)\backslash ,\backslash !$, is defined such that for ''p'' = 0, 1, 2, it reproduces the basic operations of addition, multiplication, and exponentiation as :$\backslash varphi(m,\; n,\; 0)\; =\; m+n,\backslash ,\backslash !$ :$\backslash varphi(m,\; n,\; 1)\; =\; m\backslash cdot\; n,\backslash ,\backslash !$ :$\backslash varphi(m,\; n,\; 2)\; =\; m^n,\backslash ,\backslash !$ and for ''p'' > 2 it extends these basic operations in a way that can be compared to the hyperoperations: (Aside from its historic role as a total-computable-but-not-primitive-recursive function, Ackermann's original function is seen to extend the basic arithmetic operations beyond exponentiation, although not as seamlessly as do variants of Ackermann's function that are specifically designed for that purpose—such as Goodstein's hyperoperation sequence.) In ''On the Infinite'', David Hilbert hypothesized that the Ackermann function was not primitive recursive, but it was Ackermann, Hilbert’s personal secretary and former student, who actually proved the hypothesis in his paper ''On Hilbert’s Construction of the Real Numbers''.〔〔von Heijenoort. (From Frege To Gödel ), 1967.〕 Rózsa Péter and Raphael Robinson later developed a two-variable version of the Ackermann function that became preferred by many authors. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ackermann function」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.